Robust control strategies for multi-inventory systems with average flow constraints

In this paper we consider multi–inventory systems in presence of uncertain demand. We assume that i) demand is unknown but bounded in an assigned compact set and ii) the control inputs (controlled flows) are subject to assigned constraints. Given a long–term average demand, we select a nominal flow that feeds such a demand. In this context, we are interested in a control strategy that meets at each time all possible current demands and achieves the nominal flow in the average. We provide necessary and sufficient conditions for such a strategy to exist and we characterize the set of achievable flows. Such conditions are based on linear programming and thus they are constructive. In the special case of a static flow (i.e. a system with 0–capacity buffers) we show that the strategy must be affine. The dynamic problem can be solved by a linear-saturated control strategy (inspired by the previous one). We provide numerical analysis and illustrating examples.